Out of the Cube: Augmented Rubik's Cube
نویسندگان
چکیده
منابع مشابه
Maximum Induced Subgraph of an Augmented Cube
Let ) (m max G ξ denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n -dimensional augmented cube, denoted as n AQ , a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when G is the augmented cube n AQ . In this paper, we show that i p i r i n AQ i p m max )2 2 1 2 ( = ) ( 0 = − + ∑ ξ , where r p p p > ...
متن کاملRubik's cube, music's cube
2017 marks the 40 anniversary of the Rubik’s Cube (under its original name the Magic Cube). This paper-demonstration describes explorations of the cube as a performance controller for music. The pattern of colors on a face of the cube is detected via USB video camera and supplemented by EMG data from the performer to model the performer’s interaction with the cube. This system was trialed in a ...
متن کاملStructure of the automorphism group of the augmented cube graph
The augmented cube graph AQn is the Cayley graph of Z n 2 with respect to the set of 2n− 1 generators {e1, e2, . . . , en, 00 . . . 0011, 00 . . . 0111, 11 . . . 1111}. It is known that the order of the automorphism group of the graph AQn is 2 n+3, for all n ≥ 4. In the present paper, we obtain the structure of the automorphism
متن کاملThe distinguishing number of the augmented cube and hypercube powers
The distinguishing number of a graph G, denoted D(G), is the minimum number of colors such that there exists a coloring of the vertices of G where no nontrivial graph automorphism is color-preserving. In this paper, we answer an open question posed in [3] by showing that the distinguishing number of Qpn, the p th graph power of the n-dimensional hypercube, is 2 whenever 2 < p < n − 1. This comp...
متن کاملCube vs. Cube Low Degree Test
We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a “cubes table” which assigns to every cube a low degree polynomial. The tester randomly selects two cubes (affine sub-spaces of dimension 3) that intersect on a point x ∈ F, and checks that the assignments to the cubes agree with each other on the point x. Our m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Games Technology
سال: 2011
ISSN: 1687-7047,1687-7055
DOI: 10.1155/2011/570210